A BAYESIAN SEQUENTIAL SINGLE MACHINE BATCHING AND SCHEDULING PROBLEM WITH RANDOM SETUP TIME
نویسندگان
چکیده
منابع مشابه
A Bayesian Sequential Single Machine Batching and Scheduling Problem with Random Setup Time
We consider single machine batching and scheduling problem in which the processing time of each job is known, but the setup time is a random variable from the distribution with an unknown parameter. Batch sizes are determined sequentially, that is, the size and jobs of the first batch are determined by using the prior knowledge and observed the value of a setup time, then the size and jobs of t...
متن کاملOptimum Aggregate Inventory for Scheduling Multi-product Single Machine System with Zero Setup Time
In this paper we adopt the common cycle approach to economic lot scheduling problem and minimize the maximum aggregate inventory. We allow the occurrence of the idle times between any two consecutive products and consider limited capital for investment in inventory. We assume the setup times are negligible. To achieve the optimal investment in inventory we first find the idle times which minimi...
متن کاملArtificial Immune System for Single Machine Scheduling and Batching Problem in Supply Chain
This paper addresses a production and outbound distribution scheduling problem in which a set of jobs have to be process on a single machine for delivery to customers or to other machines for further processing. We assume that there is a sufficient number of vehicles and the delivery costs is independent of batch size but it is dependent on each trip. In this paper, we present an Artificial Imm...
متن کاملSingle-machine scheduling considering carryover sequence-dependent setup time, and earliness and tardiness penalties of production
Production scheduling is one of the very important problems that industry and production are confronted with it. Production scheduling is often planned in the industrial environments while productivity in production can improve significantly the expansion of simultaneous optimization of the scheduling plan. Production scheduling and production are two areas that have attracted much attention in...
متن کاملSingle Machine Scheduling Problem with Precedence Constraints and Deteriorating Jobs
This paper considers the single machine scheduling problem with precedence constraints and deteriorating jobs. A mathematical model based on binary integer programming (BIP) is developed. By these precedence constraints, jobs can not start before completion of its all predecessors. The represented model is in two steps, in step one the earliest starting time of each job is computed, then the re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Operations Research Society of Japan
سال: 2010
ISSN: 0453-4514,2188-8299
DOI: 10.15807/jorsj.53.79